Shift-or string mat hing with super-alphabets

Faster string mat hing with super{alphabets

Shift-or string matching with super-alphabets

Given a text T [1 . . . n] and a pattern P [1 . . .m] over some alphabet Σ of size σ, we want to find all the (exact) occurrences of P in T . The well-known shift-or algorithm solves this problem in time O(ndm/we), where w is the number of bits in machine word, using bit-parallelism. We show how to extend the bit-parallelism in another direction, using super-alphabets. This gives a speed-up by ...

A Note on Randomized Algorithm for String Mat hing with Mismat hes

Abstra t. Atallah et al. [ACD01℄ introdu ed a randomized algorithm for string mat hing with mismat hes, whi h utilized fast Fourier transformation (FFT) to ompute onvolution. It estimates the s ore ve tor of mat hes between text string and a pattern string, i.e. the ve tor obtained when the pattern is slid along the text, and the number of mat hes is ounted for ea h position. In this paper, we ...

Forward - Fast - Sear h : Another Fast Variant of the Boyer - Moore String Mat

Abstra t. We present a variation of the Fast-Sear h string mat hing algorithm, a re ent member of the large family of Boyer-Moore-like algorithms, and we ompare it with some of the most e e tive string mat hing algorithms, su h as Horspool, Qui k Sear h, Tuned Boyer-Moore, Reverse Fa tor, Berry-Ravindran, and Fast-Sear h itself. All algorithms are ompared in terms of run-time e ien y, number of...

Approximate String - Mat hing over